4,911 research outputs found

    Fundamental Study of Corrective Abrasive Machining Technology

    Get PDF
    The presentation give an overview on the research activities undertaken in the AMTG, CPT in the University of Huddersfield

    Experimental and numerical study on scratching test

    Get PDF
    This paper presents recent investigation of the material removal mechanism in single grit grinding test. Single grit scratches were generated experimentally by using CBN grit on En24T steel and compared with numerical simulation by using finite element modelling (FEM). The material removal mechanism was observed along the scratch length to understand the effectiveness of ploughing and cutting mechanism throughout the scratch. Experiments showed that cutting is efficient at first half of the scratch while ploughing is significantly higher at the second half of the scratch. At the exit side of the scratch almost no material removal takes place. It has demonstrated that FEM simulations match well with experimental results

    Single Grit Grinding Simulation by Using Finite Element Analysis

    Get PDF
    In this research, basic material removal characteristics in a single grit grinding have been investigated by using Finite Element Analysis (FEA). ABAQUS/Standard is used as a computational environment. The influences of both friction and undeformed chip thickness are considered in the analyses of the grit ploughing, stress distribution and total force variation. Remeshing strategy is performed in the simulation to produce very fine meshes in the contact area to mitigate the material distortion due to large plastic deformation. The results show that the increase of undeformed chip thickness and frictional coefficient would increase ploughing action and grinding stress magnitude. Moreover, friction would cause the stress distribution circle on grit inclined backwards. Finally, FEM analysis can be considered as a strong tool for the single grit simulation of grinding process. ©2010 American Institute of Physic

    Understanding Polarization Correlation of Entangled Vector Meson Pairs

    Full text link
    We propose an experimental test of local hidden variable theories against quantum mechanics by measuring the polarization correlation of entangled vector meson pairs. In our study, the form of the polarization correlation probability is reproduced in a natural way by interpreting the two-body decay of the meson as a measurement of its polarization vector within the framework of quantum mechanics. This provides more detailed information on the quantum entanglement, thus a new Monte Carlo method to simulate the quantum correlation is introduced. We discuss the feasibility of carrying out such a test at experiments in operation currently and expect that the measured correlated distribution may provide us with deeper insight into the fundamental question about locality and reality.Comment: 7 pages, 3 figures. v3: The version published in PR

    On Efficiently Detecting Overlapping Communities over Distributed Dynamic Graphs

    Full text link
    Modern networks are of huge sizes as well as high dynamics, which challenges the efficiency of community detection algorithms. In this paper, we study the problem of overlapping community detection on distributed and dynamic graphs. Given a distributed, undirected and unweighted graph, the goal is to detect overlapping communities incrementally as the graph is dynamically changing. We propose an efficient algorithm, called \textit{randomized Speaker-Listener Label Propagation Algorithm} (rSLPA), based on the \textit{Speaker-Listener Label Propagation Algorithm} (SLPA) by relaxing the probability distribution of label propagation. Besides detecting high-quality communities, rSLPA can incrementally update the detected communities after a batch of edge insertion and deletion operations. To the best of our knowledge, rSLPA is the first algorithm that can incrementally capture the same communities as those obtained by applying the detection algorithm from the scratch on the updated graph. Extensive experiments are conducted on both synthetic and real-world datasets, and the results show that our algorithm can achieve high accuracy and efficiency at the same time.Comment: A short version of this paper will be published as ICDE'2018 poste
    • …
    corecore